Recent Advances in Combinatorial Optimization

Recent Advances in Combinatorial Optimization

1College of Science, East China Institute of Technology, Nanchang, Jiangxi 330013, China 2Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan 3School of Economics & Management, Tongji University, Shanghai 200092, China 4Laboratoire IBISC, Université d’Evry-Val d’Essone, 40 rue Pelvoux, 91001 Evry, France 5LCOMS EA7306, Université de Lorraine, Ile du Saulcy, 57...

Recent Advances in Evolutionary Computation for Combinatorial Optimization

The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.

Recent Advances in Global Optimization for Combinatorial Discrete Problems

The optimization of discrete problems is largely encountered in engineering and information domains. Solving these problems with continuous-variables approach then convert the continuous variables to discrete ones does not guarantee the optimal global solution. Evolutionary Algorithms (EAs) have been applied successfully in combinatorial discrete optimization. Here, the mathematical basics of r...

Recent Advances in Global Optimization

Recent Advances in Multiobjective Optimization

Multiobjective (or multicriteria) optimization is a research area with rich history and under heavy investigation within Operations Research and Economics in the last 60 years [1,2]. Its object of study is to investigate solutions to combinatorial optimization problems that are evaluated under several objective functions – typically defined on multidimensional attribute (cost) vectors. In multi...